Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
نویسندگان
چکیده
منابع مشابه
Regularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces
Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set ...
متن کاملIpiano: Inertial Proximal Algorithm for Non-convex Optimization
This paper studies the minimization of non-convex and non-smooth composite functions. In particular, we discuss the algorithm proposed by Ochs et al. in [14], called iPiano. Following [14], we present a global convergence result for functions satisfying the Kurdyka-Lojasiewicz property [12, 11] which is based on the work by Attouch et al. [4]. Furthermore, we discuss the implementation of iPian...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملA parameterized proximal point algorithm for separable convex optimization
In this paper, we develop a parameterized proximal point algorithm (PPPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent with a worst-case O(1/t) convergence rate, where t denotes the iteration number. By properly choosing the algorithm parameters, numerical experiments on solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Mathematical Journal
سال: 2008
ISSN: 0041-5995,1573-9376
DOI: 10.1007/s11253-009-0137-9